|
|
Making OpenType fonts with free software
Bednár, Peter ; Mekyska, Jiří (referee) ; Rajmic, Pavel (advisor)
In thesis themes of typography and computer font of OpenType format is described in details. At the beginning attention is paid to historical development of typeface, where stress is laid mainly on development of Roman and white letter with their characteristics. Having presented basis of typography work is concentrated on topic of digital font with emphasis on possibilities of OpenType format. Further its characteristics and advantages were listed compared to another formats and it was evaluated as format appropriate also for creating font in education process. Letterspacing and kerning were mentioned between basic graphical modifications in creating fonts. In theoretical part of the thesis they were examined in available programs designed for creating font in OpenType format. Except free available means into summary were included also commercial types due to absence of more advanced instruments and functions with free available applications. In evaluation was found that the most convenient for education is Fontlab Fontographer commercial program, free Type lite and Fontforge indicated for Open-source platform. Practical part of the thesis is focused on two chosen programs for creating main font characteristics. The goal was to detect if it is possible to reach identical results when using both programs. Fontographer program enabled to use wide tool palette dedicated to vector graphic processing by means of Adobe Illustrator similar instrument. In the case of Type lite program there were rather less instruments, what is sufficient for elementary work and familiarization with creating of digital typeface. Freeware shortage is basic absence of kerning, spacing or hinting functions. Comparing program possibilities, it falls that freeware programs based on OS Windows with their functionality are sufficient only for entry level users. The best option within free available programs is Fontforge for OS Linux which supports mentioned typographic functions. Fontographer was recommended for teaching of basic characteristics of OpenType font format. Another goal of the thesis was creating of recommended work procedure for creating basic characteristics of OpenType font for students, that is enclosed at the end of the thesis.
|
|
|
Mathematical modelling with L-systems
Janoutová, Růžena ; Procházková, Jana (referee) ; Martišek, Dalibor (advisor)
This work deals with L-systems and their practical utilization. The work can be devided into two parts - theoretical and applied. In the theoretical part, i.e. in the first chapter, the L-systems are discussed. There can be found their introduction and classification. Apllied part includes second and third chapter. Second chapter contains review of L-system's utilization and third chapter is dedicated to program attached to this work, his description and manual.
|
|
|
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
|
|
|
Live typeface
Jiříček, Milan ; Špiřík, Jan (referee) ; Rajmic, Pavel (advisor)
The work describes the theoretical foundations of modern methods of creating new fonts, that is, using information technology, specifically vector programs. It also marginally shows the history of the font, Roman writing, the basic division of its compositions and describes its individual elements. The next part of the project focuses on creating digital fonts and continues with bringing it to live using algorithms and methods that can easily be processed in Matlab programming language. The method of implementation of the bringing the typeface to live is described and presentation of the generated results are then shown in few examples. Attention is also paid to the coordinates system, which is very important to solve geometric transformations, and two-dimensional vector graphics, which are widely used in the design and to render the fonts. Bézier curves and cubic Bézier curves are described in further detail along with vector graphics rasterization. One part of this text describes very important de Casteljau algorithm. The last chapter focuses on implementation in Matlab programming language, the creation of curves, that means single font characters, and the ways of how the algorithm works with transformations. Some sample images showing transformations using different input arguments are displayed in this section as well. There is evaluation of the contribution of this application and the possibilities of further expansion at the end.
|
|
|
Languages, Grammars and Machines
Mocková, Ľubica ; Zimmerová, Barbora (referee) ; Bobalová, Martina (advisor)
My thesis is a brief synopsis of the basic types of formal languages, grammars and machines, which are a part of theoretical computer science. My thesis contains the survey of the theory related to the given topic and problems related to the theoretical part of my thesis. This work is to be used as a study material for the students of the Faculty of Business and Management for the subject of Discrete Mathematics. It can also be helpful for the students of other universities and faculties whose curricula contain theory of grammars and machines.
|
|
|
Machine Learning for Formal Language Model Inference
Bardonek, Petr ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with the formal language model inference, which is a science discipline on the research field of artificial intelligence. The aim is to create an appliaction that allows the automatic inference of model, such as the finite state machine, for an unknown formal language from the set of the strings of the unknown formal language using the modified machine learning method.
|
|
|
Classification of Grammars, Languages and Machines (Basic Types, Use)
Klimešová, Michaela ; Novotný, Jan (referee) ; Bobalová, Martina (advisor)
This bachelor's thesis is written as a brief list of fundamental theory on the given topic with extensions of working out methods and solving examples. The thesis is divided into two basic parts. The first part is focused on the essential theoretical pieces of knowledge about languages, grammars and machines. There is a particular explanation of the theory related to formal languages and operations on languages, grammars and their separation, and to finite state machines, together with dividing them into deterministic and nondeterministic ones. The second part is devoted to working out, explanation and calculation of the examples applied to the given topic - from the simple ones to the difficult ones.
|
|
|
Classification of Grammars, Languages and Machines (Basic Types, Use)
Klimešová, Michaela ; Novotný, Jan (referee) ; Bobalová, Martina (advisor)
This bachelor's thesis is written as a brief list of fundamental theory on the given topic with extensions of working out methods and solving examples. The thesis is divided into two basic parts. The first part is focused on the essential theoretical pieces of knowledge about languages, grammars and machines. There is a particular explanation of the theory related to formal languages and operations on languages, grammars and their separation, and to finite state machines, together with dividing them into deterministic and nondeterministic ones. The second part is devoted to working out, explanation and calculation of the examples applied to the given topic - from the simple ones to the difficult ones.
|
|
|
Languages, Grammars and Machines
Mocková, Ľubica ; Zimmerová, Barbora (referee) ; Bobalová, Martina (advisor)
My thesis is a brief synopsis of the basic types of formal languages, grammars and machines, which are a part of theoretical computer science. My thesis contains the survey of the theory related to the given topic and problems related to the theoretical part of my thesis. This work is to be used as a study material for the students of the Faculty of Business and Management for the subject of Discrete Mathematics. It can also be helpful for the students of other universities and faculties whose curricula contain theory of grammars and machines.
|
|
|
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
|
guest ::
